Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems
نویسندگان
چکیده
منابع مشابه
Block preconditioners for symmetric indefinite linear systems
This paper presents a systematic theoretical and numerical evaluation of three common block preconditioners in a Krylov subspace method for solving symmetric indefinite linear systems. The focus is on large-scale real world problems where block approximations are a practical necessity. The main illustration is the performance of the block diagonal, constrained, and lower triangular precondition...
متن کاملCompressed threshold pivoting for sparse symmetric indefinite systems
A key technique for controlling numerical stability in sparse direct solvers is threshold partial pivoting. When selecting a pivot, the entire candidate pivot column below the diagonal must be up-to-date and must be scanned. If the factorization is parallelized across a large number of cores, communication latencies can be the dominant computational cost. In this paper, we propose two alternati...
متن کاملSome Generalizations and Modifications of Iterative Methods for Solving Large Sparse Symmetric Indefinite Linear Systems
and Applied Analysis 3 Instead of solving for y directly from the triangular linear system (15), Paige and Saunders [1] factorize the matrix Tn into a lower triangular matrix with bandwidth three (resulting in the SYMMLQmethod). Also, we have TnQn−1 = ̂ Ln = [ [ [ [ [ [ [ [ [ [ γ0 δ1 γ1 ε2 δ2 γ2 d d d εn−3 δn−3 γn−3 εn−2 δn−2 γn−2 εn−1 δn−1 γn−1 ] ] ] ] ] ] ] ] ]
متن کاملA Rational Function Preconditioner For Indefinite Sparse Linear Systems
This paper introduces a rational function preconditioner for linear systems with indefinite sparse matrices A. By resorting to rational functions of A, the algorithm decomposes the spectrum of A into two disjoint regions and approximates the restriction of A−1 on these regions separately. We show a systematic way to construct these rational functions so that they can be applied stably and inexp...
متن کاملAbsolute Value Preconditioning for Symmetric Indefinite Linear Systems
We introduce a novel strategy for constructing symmetric positive definite (SPD) preconditioners for linear systems with symmetric indefinite matrices. The strategy, called absolute value preconditioning, is motivated by the observation that the preconditioned minimal residual method with the inverse of the absolute value of the matrix as a preconditioner converges to the exact solution of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2017
ISSN: 0098-3500,1557-7295
DOI: 10.1145/3104991